Tuning block-parallel all-pairs shortest path algorithm for efficient multi-core implementa- tion.

An Efficient Parallel Algorithm for the All Pairs Shortest Path Problem

The all pairs shortest path problem is a class of the algebraic path problem. Many parallel algorithms for the solution of this problem appear in the literature. One of the efficient parallel algorithms on W-RAM model is given by Kucera[17]. Though efficient, algorithms written for the W-RAM model of parallel computation are too idealistic to be implemented on the current hardware. In this repo...

An Optimal Distributed Algorithm for All-pairs Shortest-path

In this paper the network problem of determining all-pairs shortest-path is examined. A distributed algorithm which runs in O(n) time on a network of n nodes is presented. The number of messages of the algorithm is O(e+n log n) where e is the number of communication links of the network. We prove that this algorithm is time optimal.

An 'All Pairs Shortest Path' Distributed Algorithm Using 2n² Messages

Synchronisation-Efficient Parallel All-Pairs Shortest Paths Computation

All-pairs Shortest Path Algorithm based on MPI+CUDA Distributed Parallel Programming Model

In view of the problem that computing shortest paths in a graph is a complex and time-consuming process, and the traditional algorithm that rely on the CPU as computing unit solely can't meet the demand of real-time processing, in this paper, we present an all-pairs shortest paths algorithm using MPI+CUDA hybrid programming model, which can take use of the overwhelming computing power of the GP...